Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
151	arXiv:0909.2005v1 [cs.DS] 10 SepDeterministic approximation for the cover time of trees Uriel Feige∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2009-09-10 14:01:15 Analysis of algorithms SL Randomized algorithm Connectivity NP-complete problems Graph coloring Theoretical computer science Computational complexity theory Applied mathematics
152	Nearly Linear-Time Model-Based Compressive Sensing Chinmay Hegde, Piotr Indyk, and Ludwig Schmidt Massachusetts Institute of Technology, Cambridge MA 02139, USA Abstract. Compressive sensing is a method for recording a Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2015-05-25 21:19:32 Analysis of algorithms Linear algebra Computational complexity theory Numerical linear algebra Sparse approximation Time complexity Compressed sensing Big O notation Tree decomposition Theoretical computer science Mathematics Applied mathematics
153	Coverage Optimized Active Learning for k-NN Classifiers Add to Reading List Source URL: www.merl.com Language: English - Date: 2012-10-23 14:04:06 Search algorithms Statistical classification Dimension reduction Approximation algorithms Submodular set function Support vector machine K-nearest neighbor algorithm Greedy algorithm Margin classifier Mathematics Statistics Machine learning
154	Approximation Algorithms for Unique Games via Orthogonal Separators Lecture notes by Konstantin Makarychev. Lecture notes are based on the papers [CMM06a, CMM06b, LM14]. 1 Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-11-22 21:53:55 Normal distribution Applied mathematics Probability and statistics Statistics Analysis of algorithms Probabilistic complexity theory Randomized algorithm
155	Flexible Resource Allocation for Optical Networks Dmitriy Katz1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-04-27 19:14:38 Operations research Computational complexity theory Approximation algorithms Complexity classes Mathematical optimization Polynomial-time approximation scheme Dynamic programming Linear programming Algorithm Theoretical computer science Applied mathematics Mathematics
156	Modern Exact and Approximate MAP Algorithms for Graphical models Rina Dechter Bren School of Computer and Information Sciences, UC Irvine We will describe the potential of two known bounding approximation schemes for Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2013-01-24 17:11:23 Algorithm Mathematical logic Linear programming Mathematics Applied mathematics Theoretical computer science
157	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
158	CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Approximation algorithms Functions and mappings Computational complexity theory APX Logarithm Integral Function L-reduction Metric Mathematics Theoretical computer science Mathematical analysis
159	Dept of Information Systems, Business Statistics and Operations Management Join seminar Dept of Industrial Engineering & Logistics Management Approximation Algorithms for Perishable Add to Reading List Source URL: www.bm.ust.hk Language: English - Date: 2014-03-14 00:26:03 Operations research Supply chain management Marketing Manufacturing Approximation algorithm Inventory Systems engineering Industrial engineering Operations management Business Technology Management
160	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory

UPDATE